Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks

Mobile ad hoc networks (MANETs) are wireless networks that are subject to severe attacks, such as the black hole attack. One of the goals in the research is to find a method to prevent black hole attacks without decreasing network throughput or increasing routing overhead. The routing mechanism in define uses route requests (RREQs; for discovering routes) and route replies (RREPs; for receiving paths). However, this mechanism is vulnerable to attacks by malicious black hole nodes. The mechanism is developed to find the shortest secure path and to reduce overhead using the information that is available in the routing tables as an input to propose a more complex nature-inspired algorithm. The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. This method avoids dependency exclusively on the hop counts and destination sequence numbers (DSNs) that are exploited by malicious nodes in the standard AODV protocol. The experiment by performance metrics End-to-End delay and packet delivery ratio are compared in order to determine the best effort traffic. The results showed the PGO-DLLA improvement of the shortest and secure routing from black hole attack in MANET. In addition, the results indicate better performance than the related works algorithm with respect to all metrics excluding throughput which AntNet is best in routing when the pause time be more than 40 seconds. PGODLLA is able to improve the route discovery against the black hole attacks in AODV. Experiments in this thesis have shown that PGO-DLLA is able to reduce the normalized routing load, end-to-end delay, and packet loss and has a good throughput and packet delivery ratio when compared with the standard AODV protocol, BAODV protocol, and the current related protocols that enhance the routing security of the AODV protocols

Optimal robot path planning using enhanced particle swarm optimization algorithm

The aim of robot path planning is to search for a safe path for the mobile robot. Even though there exist various path planning algorithms for mobile robots, yet only a few are optimized. The optimized algorithms include the Particle Swarm Optimization (PSO) that finds the optimal path with respect to avoiding the obstacles while ensuring safety. In PSO, the sub-optimal solution takes place frequently while finding a solution to the optimal path problem. This paper proposes an enhanced PSO algorithm that contains an improved particle velocity. Experimental results show that the proposed Enhanced PSO performs better than the standard PSO in terms of solution’s quality. Hence, a mobile robot implementing the proposed algorithm operates better and is more secure

A Hybrid Least Squares Support Vector Machine with Bat and Cuckoo Search Algorithms for Time Series Forecasting

Least Squares Support Vector Machine (LSSVM) has been known to be one of the effective forecasting models. However, its operation relies on two important parameters (regularization and kernel). Pre-determining the values of parameters will affect the results of the forecasting model; hence, to find the optimal value of these parameters, this study investigates the adaptation of Bat and Cuckoo Search algorithms to optimize LSSVM parameters. Even though Cuckoo Search has been proven to be able to solve global optimization in various areas, the algorithm leads to a slow convergence rate when the step size is large. Hence, to enhance the search ability of Cuckoo Search, it is integrated with Bat algorithm that offers a balanced search between global and local. Evaluation was performed separately to further analyze the strength of Bat and Cuckoo Search to optimize LSSVM parameters. Five evaluation metrics were utilized; mean average percent error (MAPE), accuracy, symmetric mean absolute percent error (SMAPE), root mean square percent error (RMSPE) and fitness value. Experimental results on diabetes forecasting demonstrated that the proposed BAT-LSSVM and CUCKOO-LSSVM generated lower MAPE and SMAPE, at the same time produced higher accuracy and fitness value compared to particle swarm optimization (PSO)-LSSVM and a non-optimized LSSVM. Following the success, this study has integrated the two algorithms to better optimize the LSSVM. The newly proposed forecasting algorithm, termed as CUCKOO-BAT-LSSVM, produces better forecasting in terms of MAPE, accuracy and RMSPE. Such an outcome provides an alternative model to be used in facilitating decision-making in forecasting

Artificial Neural Network Hyperparameters Optimization: A Survey

Machine-learning (ML) methods often utilized in applications like computer vision, recommendation systems, natural language processing (NLP), as well as user behavior analytics. Neural Networks (NNs) are one of the most es-sential ways to ML; the most challenging element of designing a NN is de-termining which hyperparameters to employ to generate the optimal model, in which hyperparameter optimization improves NN performance. This study includes a brief explanation regarding a few types of NN as well as some methods for hyperparameter optimization, as well as previous work results in enhancing ANN performance using optimization methods that aid research-ers and data analysts in developing better ML models via identifying the ap-propriate hyperparameter configurations

An Intelligent Heuristic Algorithm Based on Tabu Search to Enhance Open Shortest Path Protocol

Nowadays, a number of artificial intelligence search algorithms have been engaged with the problem of computer networks, especially in the area of network routing problems. Nodes in a network with many connections can be called hubs and some other nodes with fewer connections can create problems in routing messages around the network. In general, the protocol Open Shortest Path First OSPF is a link state protocol and it provides a good connection performance. However, this protocol has some drawbacks such as the determination of like weights and the increase of routing load. In this paper, an intelligent heuristic method based on the Tabu Search algorithm is proposed to find the optimal link cost/weight set and to determine the best path for the OSPF in a dynamic network. The simulation results show that other paths can be checked and selected to avoid congestion problem with the optimal path